Erasure and Termination in Higher-Order Rewriting

نویسندگان

  • Jeroen Ketema
  • Femke van Raamsdonk
چکیده

Two applications of the Erasure Lemma for first-order orthogonal term rewriting systems are: weak innermost termination implies termination, and weak normalization implies strong normalization for non-erasing systems. We discuss these two results in the setting of higher-order rewriting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erasure for Termination Proofs

We introduce a technique to facilitate termination proofs for term rewriting systems. We especially focus on innermost termination. The main features of this technique lie in its simplicity and e ectiveness in practice. This work can be regarded as an application of the general notion termination through transformation to both termination and innermost termination proofs.

متن کامل

On Termination of Higher-Order Rewriting

We discuss and compare various methods to prove termination of higher-order rewriting systems.

متن کامل

Higher-Order Orderings for Normal Rewriting

We extend the termination proof methods based on reduction orderings to higher-order rewriting systems using higher-order pattern matching, and accomodate for any use of eta, as a reduction, as an expansion or as an equation.

متن کامل

Semantic Labelling for Termination of Combinatory Reduction Systems

We give a method of proving termination of Klop’s higher-order rewriting format, combinatory reduction system (CRS). Our method called higher-order semantic labelling is an extension of Zantema’s semantic labelling for first-order term rewriting systems. We systematically define the labelling by using the complete algebraic semantics of CRS.

متن کامل

Higher-Order Path Orders Based on Computability

Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004